On probabilistic term rewriting
نویسندگان
چکیده
منابع مشابه
On Probabilistic Term Rewriting
We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems are considered. Two instances of the interpretation method—polynomial and matrix interpretations—are analyzed and shown to capture interesting and n...
متن کاملTerm Graph Rewriting and Parallel Term Rewriting
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...
متن کاملConfluence in Probabilistic Rewriting
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence which is shown to imply the desired unicity (even for infinite sequences of reduction) and further properties. We then carry over several criteria from the clas...
متن کاملOn Non-looping Term Rewriting
Proving non-termination is important for instance if one wants to decide termination for given TRSs. Although the usual method is to find looping reduction sequences, there are non-looping infinite reduction sequences. We find some new interesting non-looping examples and propose new definitions of inner-looping sequence and normal sequence to classify them. We also show the undecidability of t...
متن کاملTerm Rewriting
Contents 1 Abstract Reduction Systems Abstract Term Rewriting Systems play an important role in various areas, such as abstract data type speciications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic concepts and facts for TRS's. Speciically, we discuss Abstract Reduction Systems; general Term Rewriting Systems incl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2020
ISSN: 0167-6423
DOI: 10.1016/j.scico.2019.102338